Exploring Intersection Trees for Indexing Metric Spaces
نویسنده
چکیده
Searching in a dataset for objects that are similar to a given query object is a fundamental problem for several applications that use complex data. The general problem of many similarity measures for complex objects is their computational complexity, which makes them unusable for large databases. Here, we introduce a study of a variant of a metric tree data structure for indexing and querying such data. Both a sequential and a parallel versions are introduced. The efficiency of our proposal is demonstrated through experiments on real-world data, as well as a comparison with existing techniques: MM-tree and Slim-tree.
منابع مشابه
Completeness in Probabilistic Metric Spaces
The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...
متن کاملA Characterization of Hyperbolic Spaces
A geodesic metric space is δ-hyperbolic in the sense of Gromov if and only if the intersection of any two metric balls is almost a ball. In particular, R-trees can be characterised by the property that the intersection of any two metric balls is again a metric ball.
متن کاملAn Efficient Indexing Method for Box Queries in NDDS Spaces using BoND-tree
Similarity searches in multidimensional Non-ordered Discrete Data Spaces (NDDS) are becoming increasingly important for application areas such as bioinformatics, biometrics, data mining and E-commerce. Efficient similarity searches require robust indexing techniques. Box queries (or window queries) are a type of query which specifies a set of allowed values in each dimension. Unfortunately, exi...
متن کاملResource Description and Selection for Range Query Processing in General Metric Spaces
Similarity search in general metric spaces is a key aspect in many application fields. Metric space indexing provides a flexible indexing paradigm and is solely based on the use of a distance metric. No assumption is made about the representation of the database objects. Nowadays, ever-increasing data volumes require large-scale distributed retrieval architectures. Here, local and global indexi...
متن کاملOptimizing Hashing Functions for Similarity Indexing in Arbitrary Metric and Nonmetric Spaces
A large number of methods have been proposed for similarity indexing in Euclidean spaces, and several such methods can also be used in arbitrary metric spaces. Such methods exploit specific properties of Euclidean spaces or general metric spaces. Designing generalpurpose similarity indexing methods for arbitrary metric and non-metric distance measures is a more difficult problem, due to the vas...
متن کامل